Sperner capacities
نویسندگان
چکیده
We determine the asymptotics of the largest family of qualitatively 2{independent k{ partitions of an n{set, for every k > 2. We generalize a Sperner-type theorem for 2{partite sets of KK orner and Simonyi to the k{partite case. Both results have the feature that the corresponding trivial information-theoretic upper bound is tight. The results follow from a more general Sperner capacity theorem for a family of graphs in the sense of our previous work on Sperner theorems on directed graphs.
منابع مشابه
Diierent Capacities of a Digraph Jj Anos Kk Orner
The Shannon capacity of every induced subgraph of a perfect graph equals its clique number. However, for the co{normal powers of an odd cycle the super{multiplicativity of the clique number makes the determination of capacity one of the hardest problems in combinatorics. We study the asymptotic growth of induced subgraphs of some particular type in powers of a xed graph. In case of a simple gra...
متن کامل1-Sperner hypergraphs
We introduce a new class of hypergraphs, the class of 1-Sperner hypergraphs. A hypergraph H is said to be 1-Sperner if every two distinct hyperedges e, f of H satisfy min{|e \ f |, |f \ e|} = 1. We prove a decomposition theorem for 1-Sperner hypergraphs and examine several of its consequences, including bounds on the size of 1-Sperner hypergraphs and a new, constructive proof of the fact that e...
متن کاملThe Linear Chromatic Number of Sperner Families
Let S be a set with m elements and S a complete Sperner family on S, i.e. a Sperner family such that every x ∈ S is contained in some member of S. The linear chromatic number of S, defined by Civan, is the smallest integer n with the property that there exists a function f : S → {1, . . . , n} such that if f(x) = f(y), then every set in S which contains x also contains y, or every set in S whic...
متن کاملA classification of the structures of some Sperner families and superimposed codes
In this paper we will give a new proof by using group action to prove the uniqueness of maximal Sperner familiesFmax of [n].We will also prove the uniqueness of Sperner familiesF of [n]with |F|= ( n n2 ) −1 by using a combinatorial approach. Furthermore, by using the uniqueness of Sperner family, we will classify all the structures of (1, 2) superimposed codes of size 9× 10 and 9× 11. © 2006 El...
متن کاملSperner theory pdf
In 1928 Emanuel Sperner presented a simple. Cohen, On the Sperner lemma, J. Theory 2 1967.Abstract. This paper presents elementary combinatorial proofs of Sperners. Advanced topics like degree theory or homology. Before beginning, it.ple combinatorial result known as Sperners lemma. As motivation, we examine a special case of Sperners lemma. Vick, Homology Theory.extremal two-part Sperner famil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 9 شماره
صفحات -
تاریخ انتشار 1993